Approximate Pattern Matching with Grey Scale Values
نویسنده
چکیده
We design an e cient algorithm for approximate pattern matching with grey scale values. The grey scale values range over interval [0;R] where R is a positive real number and the error bound for matching is measured by kR where k is a non-negative integer. Then we show that our algorithm solves this problem for the one-dimensional problem with O(kn logm=m) expected time, which is sublinear, where m and n are the sizes of pattern and text. For the two-dimensional problem, the expected time is O(kn 2 logm=m 2 ) where m 2 and n 2 are the sizes of pattern and text. The results are useful for time series analysis and graphics where grey scale matching is more suitable than character matching.
منابع مشابه
Adaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملLarge Scale Graph Matching(LSGM): Techniques, Tools, Applications and Challenges
Large Scale Graph Matching (LSGM) is one of the fundamental problems in Graph theory and it has applications in many areas such as Computer Vision, Machine Learning, Pattern Recognition and Big Data Analytics (Data Science). Matching belongs to the combinatorial class of problems which refers to finding correspondence between the nodes of a graph or among set of graphs (subgraphs) either precis...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملDoes Color Really Help in Dense Stereo Matching
This paper investigates the role of color in global stereo matching approaches. In our evaluation study, we build various energy functions by combining nine color spaces with four dissimilarity functions and test their performance on 30 ground truth stereo pairs. Our experiments start by computing the matching scores via the absolute difference of color values. As is consistent with previous st...
متن کامل